Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes
نویسندگان
چکیده
The traditional definition of Integrated Interleaved (II) codes generally assumes that the component nested are either Reed-Solomon (RS) or shortened codes. By taking general classes codes, we present a recursive construction Extended (EII) into multiple layers, problem brought attention in literature for II layer approach allows hierarchical scheme where each code provides different locality. In particular, erasure-correcting capability new and show they ideally suited as Locally Recoverable (LRC) due to their locality small finite field required by construction. Properties EII like minimum distance dimension, well erasure decoding algorithms, parity-check matrices performance analysis, provided illustrated with examples. Finally, will observe high have low density.
منابع مشابه
Integrated interleaved codes as locally recoverable codes: properties and performance
Considerable interest has been paid in recent literature to codes combining local and global properties for erasure correction. Applications are in cloud type of implementations, in which fast recovery of a failed storage device is important, but additional protection is required in order to avoid data loss, and in RAID type of architectures, in which total device failures coexist with silent f...
متن کاملOn Locally Recoverable (LRC) Codes
We present simple constructions of optimal erasure-correcting LRC codes by exhibiting their parity-check matrices. When the number of local parities in a parity group plus the number of global parities is smaller than the size of the parity group, the constructed codes are optimal with a field of size at least the length of the code. We can reduce the size of the field to at least the size of t...
متن کاملRegenerating Codes and Locally Recoverable Codes for Distributed Storage Systems
We survey the recent results on applying error control coding to distributed storage systems. In such systems, errors often happen in a burst manner, or maybe only one storage node in the whole distributed system fails. Therefore, only a small amount of information, e.g., one data fragment, has to be recovered. Therefore, accessing the whole data is unnecessary. Especially, we focus on regenera...
متن کاملLocally Recoverable codes from rational maps
We point some contributions to the construction of Locally Recoverable codes from algebraic curves recently presented by A. Barg, I. Tamo and S. Vladut, that can lead to improvements concerning the definition, the parameters and the local recovering of these codes.
متن کاملLocally recoverable codes from algebraic curves and surfaces
A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and Vlăduţ, we present several constructions of locally recoverable codes from algebraic curves and surfaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3166210